0 - 521 - 84903 - 6 - Multiplicative Number Theory I . Classical Theory
نویسنده
چکیده
The general rationale of analytic number theory is to derive statistical information about a sequence {an} from the analytic behaviour of an appropriate generating function, such as a power series ∑ anz or a Dirichlet series ∑ ann−s . The type of generating function employed depends on the problem being investigated. There are no rigid rules governing the kind of generating function that is appropriate – the success of a method justifies its use – but we usually deal with additive questions by means of power series or trigonometric sums, and with multiplicative questions by Dirichlet series. For example, if
منابع مشابه
A Representation of Multiplicative Arithmetic Functions by Symmetric Polynomials
We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive to the combinatorics of partitions of the integers. The representing elements are recursive sequences of Schur polynomials evaluated at subrings of the comp...
متن کاملUltra Discrete Limit in Soliton Theory and Non-Archimedean Valuation
In this article, I have studied the ultra discrete limit, which is currently studied in soliton theory, from point of view of valuation theory. A quantity obtained after taking the ultra discrete limit should be regarded as non-archimedean valuation, which is related to the p-adic valuation in number theory. The ultra discrete difference-difference equations, whose domain and range are given by...
متن کاملPretentious Multiplicative Functions and an Inequality for the Zeta-Function
We note how several central results in multiplicative number theory may be rephrased naturally in terms of multiplicative functions f that pretend to be another multiplicative function g. We formalize a ‘distance’ which gives a measure of such pretentiousness, and as one consequence obtain a curious inequality for the zeta-function. A common theme in several problems in multiplicative number th...
متن کاملBurgess Inequality in F
Let χ be a nontrivial multiplicative character of Fp2 . We obtain the following results. 1. Given ε > 0, there is δ > 0 such that if ω ∈ Fp2\Fp and I, J are intervals of size p1/4+ε, (p sufficiently large), then X x∈I y∈J χ(x + ωy) < p−δ |I| |J |. The statement is uniform in ω. 2. Given ε > 0, there is δ > 0 such that if x2+axy+by2 is not a perfect square (mod p), and if I, J ⊂ [1, p− 1] are in...
متن کاملOrie 6334 Spectral Graph Theory Lecture 21
Just like matrix Chernoff bounds were a generalization of scalar Chernoff bounds, the multiplicative weights algorithm can be generalized to matrices. Recall that in the setup for the multiplicative weight update algorithm, we had a sequence of time steps t = 1, . . . , T ; in each time step t, we made a decision i ∈ {1...N} and got a value vt(i) ∈ [0, 1]. After we made a decision in time step ...
متن کامل